|
課程名稱 |
運輸工程特論
Special Topics in Transportation Engineering |
|
開課學期 |
112-2 |
|
授課對象 |
工學院 交通工程組 |
|
授課教師 |
朱致遠 |
|
課號 |
CIE7204 |
|
課程識別碼 |
521 M5280 |
|
班次 |
|
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期三7,8,9(14:20~17:20) |
|
上課地點 |
土224 |
|
備註 |
初選不開放。
限碩士班以上
總人數上限：15人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
本課程介紹運輸最佳化的進階課題，內容包括：整數規劃求解方法、車輛派遣問題、大眾運輸路線與時刻表設計、路網可靠度、離散事件模擬、以及行人模擬與應用，學生將研讀相關期刊論文與撰寫作業。課程作業使用Python程式語言搭配Gurobi數學規劃求解軟體。本課程以中文授課。
|
|
課程目標 |
本課程介紹運輸最佳化的進階課題，內容包括：整數規劃求解方法、車輛派遣問題、大眾運輸路線與時刻表設計、路網可靠度、離散事件模擬、以及行人模擬與應用，學生將研讀相關期刊論文與撰寫作業。課程作業使用Python程式語言搭配Gurobi數學規劃求解軟體。本課程以中文授課。
|
|
課程要求 |
|
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
1. Wolsey (1998) Integer Programming.
2. Papadimitriou and Steiglitz (1998) Combinatorial optimization: algorithms and complexity.
3. Hillier and Lieberman (2009) Introduction to Operations Research, 9th edition.
4. Ahuja, Magnanti, and Orlin (1993) Network Flows: Theory, Algorithms, and Applications, by, Prentice Hall.
5. Nilsson, Heuristics for the traveling salesman problem.
6. Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the operations research society of America, 2(4), 393-410.
7. Fisher (1981) The Lagrangian Relaxation Method for Solving Integer Programming Problems.
8. Daskin, M. S. (2013) Network and Discrete Location: Models, Algorithms and Applications, John Wiley and Sons, Inc., New York, second edition.
9. Bradley, Hax, and Magnanti (1977) Applied Mathematical Programming, Addison-Wesley.
10. Barry Nelson (2013) Foundations and Methods of Stochastic Simulation, Springer
11. Law and Kelton (2003) Simulation Modeling and Analysis, 3rd edition, Mcgraw-Hill
12. Law (2014) Simulation Modeling and Analysis, 5rd edition, Mcgraw-Hill
13. Walpole, Myers, Myers, and Ye, (2017) Probability & Statistic for Engineers & Scientists,, Global 9th Edition.
14. Kelton et al. (2006) Simulation with Arena, 4th ed.
15. Solomon (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2), 254-265.
16. Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics
17. Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation science, 39(1), 104-118.
18. Bent, R. W., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52(6), 977-987.
19. Jaw, J. J., Odoni, A. R., Psaraftis, H. N., & Wilson, N. H. (1986). A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20(3), 243-257.
20. Diana, M., & Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B: Methodological, 38(6), 539-557.
21. J.-F. Cordeau, G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transp. Res. Part B: Methodol., 37 (6) (2003), pp. 579-594.
Madsen, O. B., Ravn, H. F., & Rygaard, J. M. (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of operations Research, 60(1), 193-208. |
|
參考書目 |
|
|
評量方式
(僅供參考) |
|
|
針對學生困難提供學生調整方式 |
|
上課形式 |
|
|
作業繳交方式 |
|
|
考試形式 |
|
|
其他 |
由師生雙方議定 |
|
|